Generic Fully Simulatable Adaptive Oblivious Transfer
نویسندگان
چکیده
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To this end, we present two generic constructions of adaptive OT, one of which utilizes verifiable shuffles together with threshold decryption schemes, while the other uses permutation networks together with what we call loosely-homomorphic key encapsulation schemes. We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions. Our generic methods can be extended to build universally composable (UC) secure, and leakage-resilient OT protocols.
منابع مشابه
Simulatable Adaptive Oblivious Transfer with Statistical Receiver's Privacy
During an adaptive oblivious transfer (OT), a sender has n private documents, and a receiver can adaptively fetch k documents from them such that the sender learns nothing about the receiver’s selection and the receiver learns nothing more than those k documents. Most recent fully simulatable adaptive OT schemes are based on so-called “assisted decryption” or “blind decryption”. In this paper, ...
متن کاملEfficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption
At Asiacrypt 2009, Kurosawa and Nojima showed a fully simulatable adaptive oblivious transfer (OT) protocol under the DDH assumption in the standard model. However, Green and Hohenberger pointed out that the communication cost of each transfer phase is O(n), where n is the number of the sender’s messages. In this paper, we show that the cost can be reduced to O(1) by utilizing a verifiable shuf...
متن کاملSimple Adaptive Oblivious Transfer without Random Oracle
Adaptive oblivious transfer (OT) is a two-party protocol which simulates an ideal world such that the sender sends M1, · · · ,Mn to the trusted third party (TTP), and the receiver receives Mσi from TTP adaptively for i = 1, 2, · · · k. This paper shows the first pairing-free fully simulatable adaptive OT. It is also the first fully simulatable scheme which does not rely on dynamic assumptions. ...
متن کاملPractical Fully Simulatable Oblivious Transfer with Sublinear Communication
During an adaptive k-out-of-N oblivious transfer (OT), a sender has N private documents, and a receiver wants to adaptively fetch k documents from them such that the sender learns nothing about the receiver’s selection and the receiver learns nothing more than those chosen documents. Many fully simulatable and universally composable adaptive OT schemes have been proposed, but those schemes typi...
متن کاملObtaining Efficient Fully Simulatable Oblivious Transfer from General Assumptions
We introduce a general construction of fully simulatable oblivious transfer based on lossy encryption. Furthermore, we extend the common definition of lossy encryption by introducing the notion of computationally lossy encryption. If the cryptosystem used is computationally lossy, our general construction yields oblivious transfer protocols with computational security for both parties. Otherwis...
متن کامل